Lower Bounds for Restricted-Use Objects

Lower Bounds for Restricted-Use Objects

Concurrent objects play a key role in the design of applications for multi-core architectures, making it imperative to precisely understand their complexity requirements. For some objects, it is known that implementations can be significantly more efficient when their usage is restricted. However, apart from the specific restriction of one-shot implementations, where each process may apply only...

Some Lower Bounds for Estrada Index

Convergent Lower Bounds for Packing Problems via Restricted Dual Polytopes

Cutting-stock and bin-packing problems have been widely studied in the operations research literature for their large range of industrial applications. Many integer programming models have been proposed for them. The most famous is from Gilmore and Gomory [5] and relies on a column generation scheme. Column generation methods are known to have convergence issues, and (when minimizing) no useful...

Lower Bounds for Perfect Matching in Restricted Boolean Circuits

We consider three restrictions on Boolean circuits: bijectivity, consistency and mul-tilinearity. Our main result is that Boolean circuits require exponential size to compute the bipartite perfect matching function when restricted to be (i) bijective or (ii) consistent and multilinear. As a consequence of the lower bound on bijec-tive circuits, we prove an exponential size lower bound for monot...

Lower bounds for restricted read-once parity branching programs

We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open problem. The following variant is well–motivated more general than variants for that lower bounds...